Non-uniform deterministic routing on F-Chord(α)
نویسندگان
چکیده
In this paper, we present a family of novel P2P routing schemes based on Chord [26] (and its variation FChord(α) [2]) that trades off uniformity with efficiency without using any additional overhead. We prove that H-FChord(α)’s routing is more efficient than in F-Chord(α) in terms of its average path length that is O(logn/ log logn). We also show, by simulations, that H-F-Chord(α) is more efficient than the corresponding F-Chord(α) by a percentage that goes from 15% to 22% even for small n.
منابع مشابه
Chord: Structured Overlay Network for Non-Uniform Load-Distribution
Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of O(logN) in networks of N nodes. While the routing performance has bee...
متن کاملS-Chord: Using Symmetry to Improve Lookup Efficiency in Chord
Chord is one of the simplest peer-to-peer systems that addresses the issue of eecient data location. Despite its simplicity, one of its main limitations remains the asymmetric organization of its routing. This leads to problems like inability to make in-place notiications of routing entry changes, and incapacity to support symmetric applications and to eeciently exploit network proximity. As a ...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملKnow thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗†
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world networks. In each of these networks, a node has out-degree O(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. Our contribu...
متن کاملRChord: An Enhanced Chord System Resilient to Routing Attacks
In this paper, we propose a variant of Chord system that is resilient to routing attacks. By routing attacks, we mean the attacks which detour the looking up messages, aiming to disrupt the performance of data look-up systems by increasing the path length of queries. Chord routes messages uni-directionally and has no bi-directional edges. While its performance in the absence of routing attacks ...
متن کامل